Analysis of the algorithm: From kernels to backup genes.

Kernelization section

The algorithm transformed the semantic similarity matrix to make it compatible with a kernel. Once this was done for each network and kernel type, it was integrated by kernel type. Below there is a general analysis of the properties of each matrix in the different phases of the process.

Annotations properties

Table 1. Annotation files descriptors

Net Min Max Average Standard_Deviation
phenotype 1 251 34.960396039603964 53.4410936924901
molecular_function 1 7 2.3820224719101124 2.7314234672242548
biological_process 1 17 4.25 5.339653992713831
cellular_component 1 8 3.241758241758242 3.7898070350134403

Matrix properties

Table 2. Similarity matrixes

Net Matrix_Dimensions Matrix_Elements Matrix_Elements_Non_Zero
cellular_component_sim 91x91 8281 8190
biological_process_sim 84x84 7056 6046
molecular_function_sim 89x89 7921 7832
phenotype_sim 101x101 10201 10100

Table 3. Filtered similarity matrixes

Table 4. Uncombined kernel matrixes

Net Kernel Matrix_Dimensions Matrix_Elements Matrix_Elements_Non_Zero
phenotype rf 101x101 10201 10201
molecular_function rf 89x89 7921 7921
biological_process rf 84x84 7056 7056
cellular_component rf 91x91 8281 8281
phenotype ct 101x101 10201 10201
molecular_function ct 89x89 7921 7921
biological_process ct 84x84 7056 7056
cellular_component ct 91x91 8281 8281

Table 5. Integrated kernel matrixes

Integration Kernel Matrix_Dimensions Matrix_Elements Matrix_Elements_Non_Zero
mean rf 200x200 40000 20186
mean ct 200x200 40000 20186

Weight values

Comparing types of kernel

Comparing integrations and kernel types